Sciweavers

1632 search results - page 310 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
106
Voted
CDC
2009
IEEE
156views Control Systems» more  CDC 2009»
15 years 8 months ago
The nullspace method - a unifying paradigm to fault detection
— The nullspace method is a powerful framework to solve the synthesis problem of fault detection filters in the most general setting. It is also well suited to address the least...
András Varga
CORR
2006
Springer
109views Education» more  CORR 2006»
15 years 3 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
163
Voted
WACV
2005
IEEE
15 years 9 months ago
Epipolar Constraints for Vision-Aided Inertial Navigation
— This paper describes a new method to improve inertial navigation using feature-based constraints from one or more video cameras. The proposed method lengthens the period of tim...
David D. Diel, Paul DeBitetto, Seth J. Teller
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
16 years 3 months ago
PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
Vagelis Hristidis, Nick Koudas, Yannis Papakonstan...
SPAA
2009
ACM
16 years 15 days ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...