Sciweavers

122 search results - page 2 / 25
» Lipschitz Robustness of Timed I O Systems
Sort
View
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
13 years 10 months ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour
CHI
2007
ACM
14 years 5 months ago
iStuff mobile: rapidly prototyping new mobile phone interfaces for ubiquitous computing
iStuff Mobile is the first rapid prototyping framework that helps explore new sensor-based interfaces with existing mobile phones. It focuses on sensor-enhanced physical interface...
Rafael Ballagas, Faraz Memon, Rene Reiners, Jan O....
ICRA
2005
IEEE
96views Robotics» more  ICRA 2005»
13 years 10 months ago
Robust Real-Time Visual Tracking: Comparison, Theoretical Analysis and Performance Evaluation
— In this paper, two real-time pose tracking algorithms for rigid objects are compared. Both methods are 3D-model based and are capable of calculating the pose between the camera...
Andrew I. Comport, Danica Kragic, Éric Marc...
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 4 months ago
Sub-Nyquist Sampling of Short Pulses: Part I
We develop sub-Nyquist sampling systems for analog signals comprised of several, possibly overlapping, finite duration pulses with unknown shapes and time positions. Efficient sam...
Ewa Matusiak, Yonina C. Eldar
VLDB
2002
ACM
143views Database» more  VLDB 2002»
13 years 4 months ago
SQL Memory Management in Oracle9i
Complex database queries require the use of memory-intensive operators like sort and hashjoin. Those operators need memory, also referred to as SQL memory, to process their input ...
Benoît Dageville, Mohamed Zaït