Search For:

Displaying 1-50 out of 596 total
iWIRES: an analyze-and-edit approach to shape manipulation
Found in: ACM Transactions on Graphics (TOG)
By Daniel Cohen-Or, Niloy J. Mitra, Olga Sorkine, Ran Gal, Daniel Cohen-Or, Niloy J. Mitra, Olga Sorkine, Ran Gal, Daniel Cohen-Or, Niloy J. Mitra, Olga Sorkine, Ran Gal, Daniel Cohen-Or, Niloy J. Mitra, Olga Sorkine, Ran Gal
Issue Date:July 2009
pp. 1-2
Man-made objects are largely dominated by a few typical features that carry special characteristics and engineered meanings. State-of-the-art deformation tools fall short at preserving such characteristic features and global structure. We introduce iWIRES,...
     
Two-query PCP with subconstant error
Found in: Journal of the ACM (JACM)
By Dana Moshkovitz, Ran Raz, Ran Raz, Ran Raz
Issue Date:June 2010
pp. 1-29
We show that the NP-Complete language 3Sat has a PCP verifier that makes two queries to a proof of almost-linear size and achieves subconstant probability of error ϵ=o(1). The verifier performs only projection tests, meaning that the answer to...
     
Research on a Kind of High Efficiency Cloud Service Recommendation Algorithm
Found in: 2013 International Conference on Cloud Computing and Big Data (CloudCom-Asia)
By Ran Jin,Chunhai Kou,Ruijuan Liu,Yefeng Li,Ran Jin
Issue Date:December 2013
pp. 291-296
As the third wave of the IT following personal computers, the Internet, cloud computing is not only the revolution of modern information technology, but also more of the innovation of modern business model. From cloud computing to cloud services, "clo...
 
MK-pad: a Mouse+Keyboard input technique for distance interaction through a mobile tablet device
Found in: Proceedings of the 11th Asia Pacific Conference on Computer Human Interaction (APCHI '13)
By Boyuan Yuan, Chunchuan Lv, M. L. Dennis Wong, Nancy Diniz, Ran Bi, Ran Hai-Ning
Issue Date:September 2013
pp. 231-236
We introduce MK-Pad (Mouse+Keyboard Pad), a technique for entering text and performing mouse operations using a tablet device for distance interaction. MK-Pad uses the screen of a 10.1" tablet touchscreen to host a soft keyboard and turns the screen into a...
     
The Development Model of the Tertiary Groundwater in the Southern Xiaoliaohe Based on Fuzzy Identification Model
Found in: Biomedical Engineering and Biotechnology, International Conference on
By Jun Pan,Ran-ran Kang,Chun-yang Han,Shi-xiao Li
Issue Date:May 2012
pp. 1799-1802
Based on the development and utilization of the Tertiary groundwater in southern Xialiaohe aquifer, the development pattern of up Tertiary groundwater is established, the primary evaluating indicators include the extraction coefficient of groundwater, the ...
 
The Research of Rehabilitation Robots BCI Technology Based on EEG
Found in: Computer Science and Software Engineering, International Conference on
By Yuran Zhu, Ran Zhen, Hongwei Liu, Shang Meng, Ran Zhen
Issue Date:December 2008
pp. 1107-1110
Brain-Computer Interface (BCI) is a new type of man-machine interfaces and one of the key technologies of rehabilitation robot. In this paper, the BCI system structure, working principle and the key technology are discussed. The dummy matrix based on event...
 
Error Reduction for Extractors
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By Ran Raz, Omer Reingold, Ran Raz, Salil Vadhan
Issue Date:October 1999
pp. 191
We present a general method to reduce the error of any extractor. Our method works particularly well in the case that the original extractor extracts up to a constant fraction of the source min-entropy and achieves a polynomially small error. In that case,...
 
Persistent Transactional Memory
Found in: IEEE Computer Architecture Letters
By Zhaoguo Wang,Han Yi,Ran Liu,Mingkai Dong,Haibo Chen
Issue Date:June 2014
pp. 1
This paper proposes persistent transactional memory (PTM), a new design that adds durability to transactional memory (TM) by incorporating with the emerging non-volatile memory (NVM). PTM dynamically tracks transactional updates to cache lines to ensure th...
 
Metastability in Better-Than-Worst-Case Designs
Found in: 2014 20th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC)
By Salomon Beer,Marco Cannizzaro,Jordi Cortadella,Ran Ginosar,Luciano Lavagno
Issue Date:May 2014
pp. 101-102
Better-Than-Worst-Case-Designs use timing speculation to run with a cycle period faster than the one required for worst-case conditions. This speculation may produce timing violations and metastability that result in failures and non-deterministic timing b...
 
Local Thresholding in General Network Graphs
Found in: IEEE Transactions on Knowledge and Data Engineering
By Ran Wolff
Issue Date:April 2014
pp. 916-928
Local thresholding algorithms were first presented more than a decade ago and have since been applied to a variety of data mining tasks in peer-to-peer systems, wireless sensor networks, and in grid systems. One critical assumption made by those algorithms...
 
At-speed interconnect testing and test-path optimization for 2.5D ICs
Found in: 2014 IEEE 32nd VLSI Test Symposium (VTS)
By Ran Wang,Krishnendu Chakrabarty,Sudipta Bhawmik
Issue Date:April 2014
pp. 1-6
Interposer-based 2.5D integrated circuits (ICs) are seen today as a first step towards the eventual industry adoption of 3D ICs based on through-silicon vias (TSVs). The TSVs and the redistribution layer (RDL) in the silicon interposer, and micro-bumps in ...
   
Robust Recovery of Corrupted Low-RankMatrix by Implicit Regularizers
Found in: IEEE Transactions on Pattern Analysis and Machine Intelligence
By Ran He, Tieniu Tan, Liang Wang
Issue Date:April 2014
pp. 770-783
Low-rank matrix recovery algorithms aim to recover a corrupted low-rank matrix with sparse errors. However, corrupted errors may not be sparse in real-world problems and the relationship between ℓ 1 regularizer on noise and robust M-estimators is still unk...
 
The effect of robot appearance types on motivating donation
Found in: Proceedings of the 2014 ACM/IEEE international conference on Human-robot interaction (HRI '14)
By Jung Ju Choi, Ran Hee Kim, Sonya S. Kwak, Yeop Moon
Issue Date:March 2014
pp. 210-211
According to the Hawthorne effect, when people feel someone staring at them, they tend to be moral because of psychological pressure. We applied this Hawthorne effect to the appearance design of robots and examined the effect of robot appearance types on m...
     
Guest Editors' Introduction - Special Issue on Network-on-Chip
Found in: IEEE Transactions on Computers
By Ran Ginosar,Karam S. Chatha
Issue Date:March 2014
pp. 527-528
Network-on-Chip (NoC) has emerged as a key architecture component that determines the overall performance, power, and area (PPA) of a contemporary System-on-Chip (SoC) device. The PPA characteristics of NoC are influenced by a wide range of issues, includi...
 
Half-Quadratic-Based Iterative Minimization for Robust Sparse Representation
Found in: IEEE Transactions on Pattern Analysis and Machine Intelligence
By Ran He, Wei-Shi Zheng, Tieniu Tan, Zhenan Sun
Issue Date:February 2014
pp. 261-275
Robust sparse representation has shown significant potential in solving challenging problems in computer vision such as biometrics and visual surveillance. Although several robust sparse models have been proposed and promising results have been obtained, t...
 
Generalized MultiAmdahl: Optimization of Heterogeneous Multi-Accelerator SoC
Found in: IEEE Computer Architecture Letters
By Amir Morad,Tomer Y. Morad,Yavits Leonid,Ran Ginosar,Uri Weiser
Issue Date:January 2014
pp. 1-1
Consider a workload comprising a consecutive sequence of program execution segments, where each segment can either be executed on general purpose processor or offloaded to a hardware accelerator. An analytical optimization framework based on MultiAmdhal fr...
 
Energy Aware Race to Halt: A Down to EARtH Approach for Platform Energy Management
Found in: IEEE Computer Architecture Letters
By Rotem Efraim,Ran Ginosar,C. Weiser,Avi Mendelson
Issue Date:January 2014
pp. 1-1
The EARtH algorithm finds the optimal voltage and frequency operational point of the processor in order to achieve minimum energy of the computing platform. The algorithm is based on a theoretical model employing a small number of parameters, which are ext...
 
Linear-Time Approximation for Maximum Weight Matching
Found in: Journal of the ACM (JACM)
By Ran Duan, Seth Pettie
Issue Date:January 2014
pp. 1-23
The maximum cardinality and maximum weight matching problems can be solved in Õ(m√n) time, a bound that has resisted improvement despite decades of research. (Here m and n are the number of edges and vertices.) In this article, we demonstrate ...
     
Mesh saliency via spectral processing
Found in: ACM Transactions on Graphics (TOG)
By Paul L. Rosin, Ralph R. Martin, Ran Song, Yonghuai Liu
Issue Date:January 2014
pp. 1-17
We propose a novel method for detecting mesh saliency, a perceptually-based measure of the importance of a local region on a 3D surface mesh. Our method incorporates global considerations by making use of spectral attributes of the mesh, unlike most existi...
     
Evaluation of Multi-threaded Processor Designs for Energy Efficient Embedded Systems
Found in: 2013 IEEE 16th International Conference on Computational Science and Engineering (CSE)
By Ran Zhang,Hui Guo
Issue Date:December 2013
pp. 619-626
Multi-threaded processor designs enable high performance of a single processor core by exploiting both the thread-level and instruction-level parallelism. The performance gain is, however, at the cost of increasing energy consumption, which is not desirabl...
 
A Framework for Earth System Model Application Monitoring
Found in: 2013 IEEE 16th International Conference on Computational Science and Engineering (CSE)
By Ran Yan,Jieqian Wu,Yibo Xie,You Meng,Depei Qian
Issue Date:December 2013
pp. 1343-1348
Earth System Model (ESM) is an important tool for the research on global environmental evolution using numerical approach. Here we present a monitoring method for ESM applications based on "Earth System Model Oriented Integrated Developing Environment...
 
Simulated Annealing Partitioning: An Algorithm for Optimizing Grouping in Cancer Data
Found in: 2013 IEEE 13th International Conference on Data Mining Workshops (ICDMW)
By Ran Qi,Shujia Zhou
Issue Date:December 2013
pp. 281-286
Cancer survival prediction usually depends on a clinically useful classification scheme. Grouping in cancer datasets is needed for this classification process [1]. Partitioning Around Medoids (PAM) is a classical clustering algorithm that is often used to ...
 
Learning Coupled Feature Spaces for Cross-Modal Matching
Found in: 2013 IEEE International Conference on Computer Vision (ICCV)
By Kaiye Wang,Ran He,Wei Wang,Liang Wang,Tieniu Tan
Issue Date:December 2013
pp. 2088-2095
Cross-modal matching has recently drawn much attention due to the widespread existence of multimodal data. It aims to match data from different modalities, and generally involves two basic problems: the measure of relevance and coupled feature selection. M...
 
Robust Subspace Clustering via Half-Quadratic Minimization
Found in: 2013 IEEE International Conference on Computer Vision (ICCV)
By Yingya Zhang,Zhenan Sun,Ran He,Tieniu Tan
Issue Date:December 2013
pp. 3096-3103
Subspace clustering has important and wide applications in computer vision and pattern recognition. It is a challenging task to learn low-dimensional subspace structures due to the possible errors (e.g., noise and corruptions) existing in high-dimensional ...
 
Application and Prospect of the Virtual Reality Technology in College Ideological Education
Found in: 2013 Fourth International Conference on Intelligent Systems Design and Engineering Applications (ISDEA)
By Ran Hui-Zhen,Liu Zong-Fa
Issue Date:November 2013
pp. 125-128
The next generation network is an effective measure to solve the current existing problems of the network. And the routing and exchange is the key to implement the next generation network. Thus, it is needed to study and sum up in-depth. First of all, this...
 
Tensor-Rank and Lower Bounds for Arithmetic Formulas
Found in: Journal of the ACM (JACM)
By Ran Raz
Issue Date:November 2013
pp. 1-15
We show that any explicit example for a tensor A : [n]r → F with tensor-rank ≥ nrċ(1−o(1)), where r = r(n) ≤ log n/log log n is super-constant, implies an explicit super-polynomial lower bound for the size of general arithmetic...
     
Post-bond Testing of the Silicon Interposer and Micro-bumps in 2.5D ICs
Found in: 2013 22nd Asian Test Symposium (ATS)
By Ran Wang,Krishnendu Chakrabarty,Bill Eklow
Issue Date:November 2013
pp. 147-152
2.5D integration is emerging as a precursor to stacked 3D ICs. Since the silicon interposer and micro-bumps in 2.5D integration can suffer from fabrication and assembly defects, post-bond testing is necessary for product qualification. This paper proposes ...
 
Computer Architecture With Associative Processor Replacing Last Level Cache and SIMD Accelerator
Found in: IEEE Transactions on Computers
By Leonid Yavits,Amir Morad,Ran Ginosar
Issue Date:November 2013
pp. 1
This study presents a computer architecture where a last level cache and a SIMD accelerator are replaced by an Associative Processor. Associative Processor combines data storage and data processing, and functions as a massively parallel SIMD processor and ...
 
Accelerate MapReduce on GPUs with multi-level reduction
Found in: Proceedings of the 5th Asia-Pacific Symposium on Internetware (Internetware '13)
By Qin Zhang, Ran Zheng, Hai Jin, Kai Liu, Xiaowen Feng
Issue Date:October 2013
pp. 1-8
With Graphics Processing Units (GPUs) becoming more and more popular in general purpose computing, more attentions have been paid on building a framework to provide convenient interfaces for GPU programming. MapReduce can greatly simplify the programming f...
     
Improved Average-Case Lower Bounds for DeMorgan Formula Size
Found in: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS)
By Ilan Komargodski,Ran Raz,Avishay Tal
Issue Date:October 2013
pp. 588-597
We give an explicit function h: {0, 1} n → {0, 1} such that every deMorgan formula of size n 3-o(1) /r 2 agrees with h on at most a fraction of 1/2+2 -Ω(r) of the inputs. This improves the previous average-case lower bound of Komargodski and Raz (STOC, 201...
 
From Unprovability to Environmentally Friendly Protocols
Found in: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS)
By Ran Canetti, Huijia Lin,Rafael Pass
Issue Date:October 2013
pp. 70-79
An important security concern for crypto-graphic protocols is the extent to which they adversely affect the security of the systems in which they run. In particular, can we rule out the possibility that introducing a new protocol to a system might, as a
 
OFF-set: one-pass factorization of feature sets for online recommendation in persistent cold start settings
Found in: Proceedings of the 7th ACM conference on Recommender systems (RecSys '13)
By Edward Bortnikov, Liron Levin, Michal Aharon, Natalie Aizenberg, Ohad Serfaty, Ran Roth, Roi Adadi, Ronny Lempel, Tomer Benyamini
Issue Date:October 2013
pp. 375-378
One of the most challenging recommendation tasks is recommending to a new, previously unseen user. This is known as the user cold start problem. Assuming certain features or attributes of users are known, one approach for handling new users is to initially...
     
Supporting interoperability and presence awareness in collaborative mixed reality environments
Found in: Proceedings of the 19th ACM Symposium on Virtual Reality Software and Technology (VRST '13)
By Angelika Peer, Anthony Steed, Benjamin Cohen, Franco Tecchia, Laith Alkurdi, Oyewole Oyekoya, Ran Stone, Stefan Klare, Tim Weyrich, William Steptoe
Issue Date:October 2013
pp. 165-174
In the BEAMING project we have been extending the scope of collaborative mixed reality to include the representation of users in multiple modalities, including augmented reality, situated displays and robots. A single user (a visitor) uses a high-end virtu...
     
Delay sensitive distributed sensor data exchange for an IoT
Found in: Proceedings of the International Workshop on Adaptive Security (ASPI '13)
By Ran Tao, Stefan Poslad
Issue Date:September 2013
pp. 1-8
Publish Subscribe Message Oriented Middleware or PSMOM is widely deployed in the IoT. This uses message brokers to enable open and distributed sensor data publishers (or pub) and sensor data subscribers (or sub) to exchange information asynchronously using...
     
Bio-inspired Application Scheduling Algorithm for Mobile Cloud Computing
Found in: 2013 Fourth International Conference on Emerging Intelligent Data and Web Technologies (EIDWT)
By Xianglin Wei,Jianhua Fan,Ziyi Lu,Ke Ding,Ran Li,Guomin Zhang
Issue Date:September 2013
pp. 690-695
Mobile Cloud Computing (MCC) enables the mobile devices to offload their applications to the cloud, and thus greatly enriches the types of applications on mobile devices and enhances the quality of service of the applications. Under various circumstances, ...
 
Design Tradeoffs of Long Links in Hierarchical Tiled Networks-on-Chip
Found in: 2013 Euromicro Conference on Digital System Design (DSD)
By Ran Manevich,Leon Polishuk,Israel Cidon,Avinoam Kolodny
Issue Date:September 2013
pp. 769-776
Hierarchical topologies are frequently proposed for large Networks-on-Chip (NoCs). Hierarchical architectures utilize, at the upper levels, long links of the order of the die size. RC delays of long links might reach dozens of clock cycles in advanced tech...
 
Design Tradeoffs of Long Links in Hierarchical Tiled Networks-on-Chip
Found in: 2013 Euromicro Conference on Digital System Design (DSD)
By Ran Manevich,Leon Polishuk,Israel Cidon,Avinoam Kolodny
Issue Date:September 2013
pp. 769-776
Hierarchical topologies are frequently proposed for large Networks-on-Chip (NoCs). Hierarchical architectures utilize, at the upper levels, long links of the order of the die size. RC delays of long links might reach dozens of clock cycles in advanced tech...
 
Bio-inspired Application Scheduling Algorithm for Mobile Cloud Computing
Found in: 2013 Fourth International Conference on Emerging Intelligent Data and Web Technologies (EIDWT)
By Xianglin Wei,Jianhua Fan,Ziyi Lu,Ke Ding,Ran Li,Guomin Zhang
Issue Date:September 2013
pp. 690-695
Mobile Cloud Computing (MCC) enables the mobile devices to offload their applications to the cloud, and thus greatly enriches the types of applications on mobile devices and enhances the quality of service of the applications. Under various circumstances, ...
 
Performance Analysis of Software-Defined Networking (SDN)
Found in: 2013 IEEE 21st International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems (MASCOTS)
By Alexander Gelberger,Niv Yemini,Ran Giladi
Issue Date:August 2013
pp. 389-393
Software-Defined Networking (SDN) approaches were introduced as early as the mid-1990s, but just recently became a well-established industry standard. Many network architectures and systems adopted SDN, and vendors are choosing SDN as an alternative to the...
 
High-Accuracy TDOA-Based Localization without Time Synchronization
Found in: IEEE Transactions on Parallel and Distributed Systems
By Bin Xu,Guodong Sun,Ran Yu,Zheng Yang
Issue Date:August 2013
pp. 1567-1576
Localization is of great importance in mobile and wireless network applications. Time Difference of Arrival (TDOA) is one of the widely used localization schemes, in which the target (source) emits a signal and a number of anchors (receivers) record the ar...
 
Ease the Queue Oscillation: Analysis and Enhancement of DCTCP
Found in: 2013 IEEE 33rd International Conference on Distributed Computing Systems (ICDCS)
By Wen Chen, Peng Cheng, Fengyuan Ren, Ran Shu, Chuang Lin
Issue Date:July 2013
pp. 450-459
Because of the terrible performance of TCP protocol in data center environment, DCTCP has been proposed as a TCP replacement, which uses a simple marking mechanism at switches and a few amendments at end hosts to adjust congestion window based on the exten...
 
Meet me far
Found in: ACM SIGGRAPH 2013 Computer Animation Festival (SIGGRAPH '13)
By Ran Sieradzki
Issue Date:July 2013
pp. 1-1
Loneliness. A falling feather triggers a fantasy for a lonely character, sitting on a floating island. At first, his fantasy is naive and easy, but it soon becomes too much, and the character wants out.
     
Data management systems on GPUs: promises and challenges
Found in: Proceedings of the 25th International Conference on Scientific and Statistical Database Management (SSDBM)
By Anand Kumar, Di Yu, Ran Rui, Ryan Wheeler, Yi-Cheng Tu
Issue Date:July 2013
pp. 1-4
The past decade has witnessed the popularity of push-based data management systems, in which the query executor passively receives data from either remote data sources (e.g., sensors) or I/O processes that scan database tables/files from local storage. Unl...
     
Cache Hierarchy Optimization
Found in: IEEE Computer Architecture Letters
By Leonid Yavits,Amir Morad,Ran Ginosar
Issue Date:July 2013
pp. 1
Abstract— Power consumption, off-chip memory bandwidth, chip area and Network on Chip (NoC) capacity are among main chip resources limiting the scalability of Chip Multiprocessors (CMP). A closed form analytical solution for optimizing the CM...
 
Preliminary Study on Automatic Modeling Method of 3D Relief Symbols with Building-Up Style
Found in: 2013 Seventh International Conference on Image and Graphics (ICIG)
By Nai Yang,Ran Yi,Lin Wan
Issue Date:July 2013
pp. 618-622
The relief models made by the common modeling software are difficult to be consistent with the digital terrain model (DTM) and cannot fully express their morphological characteristics (such as the form, the structure, the spatial distributions and so on). ...
 
Interactive channel capacity
Found in: Proceedings of the 45th annual ACM symposium on Symposium on theory of computing (STOC '13)
By Gillat Kol, Ran Raz
Issue Date:June 2013
pp. 715-724
We study the interactive channel capacity of an ε-noisy channel. The interactive channel capacity C(ε) is defined as the minimal ratio between the communication complexity of a problem (over a non-noisy channel), and the communication complexity ...
     
Delegation for bounded space
Found in: Proceedings of the 45th annual ACM symposium on Symposium on theory of computing (STOC '13)
By Ran Raz, Ron D. Rothblum, Yael Tauman Kalai
Issue Date:June 2013
pp. 565-574
We construct a 1-round delegation scheme for every language computable in time t=t(n) and space s=s(n), where the running time of the prover is poly(t) and the running time of the verifier is ~O(n + poly(s)) (where ~O hides polylog(t) factors). The proof e...
     
Average-case lower bounds for formula size
Found in: Proceedings of the 45th annual ACM symposium on Symposium on theory of computing (STOC '13)
By Ilan Komargodski, Ran Raz
Issue Date:June 2013
pp. 171-180
We give an explicit function h:{0,1}n->{0,1} such that any deMorgan formula of size O(n2.499) agrees with h on at most 1/2 + ε fraction of the inputs, where ε is exponentially small (i.e. ε = 2-nΩ(1)). We also show, using the same te...
     
Recursive composition and bootstrapping for SNARKS and proof-carrying data
Found in: Proceedings of the 45th annual ACM symposium on Symposium on theory of computing (STOC '13)
By Alessandro Chiesa, Eran Tromer, Nir Bitansky, Ran Canetti
Issue Date:June 2013
pp. 111-120
Succinct non-interactive arguments of knowledge (SNARKs) enable verifying NP statements with complexity that is essentially independent of that required for classical NP verification. In particular, they provide strong solutions to the problem of verifiabl...
     
A Meta-Synthesis Approach for Cloud Service Provider Selection Based on SecSLA
Found in: 2013 Fifth International Conference on Computational and Information Sciences (ICCIS)
By Jiang Zhengwei,Du Ran,Lu Zhigang,Wu Xihong,Liu Baoxu
Issue Date:June 2013
pp. 1356-1360
The Service Level Agreement(SLA) of current cloud computing often focuses on performance while seldom emphasizes security; additionally, customers have to select the most suitable one among several Cloud Service Providers (CSPs). Therefore, a cloud-oriente...
 
 1  2 Next >>