Sciweavers

4843 search results - page 406 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
ICDE
2004
IEEE
144views Database» more  ICDE 2004»
16 years 6 months ago
Spatio-Temporal Aggregation Using Sketches
Several spatio-temporal applications require the retrieval of summarized information about moving objects that lie in a query region during a query interval (e.g., the number of m...
Yufei Tao, George Kollios, Jeffrey Considine, Feif...
ICML
2007
IEEE
16 years 5 months ago
Incremental Bayesian networks for structure prediction
We propose a class of graphical models appropriate for structure prediction problems where the model structure is a function of the output structure. Incremental Sigmoid Belief Ne...
Ivan Titov, James Henderson
ICML
2008
IEEE
16 years 5 months ago
Learning to classify with missing and corrupted features
After a classifier is trained using a machine learning algorithm and put to use in a real world system, it often faces noise which did not appear in the training data. Particularl...
Ofer Dekel, Ohad Shamir
STOC
2005
ACM
118views Algorithms» more  STOC 2005»
16 years 5 months ago
Euclidean distortion and the sparsest cut
We prove that every n-point metric space of negative type (and, in particular, every npoint subset of L1) embeds into a Euclidean space with distortion O( log n ? log log n), a r...
Sanjeev Arora, James R. Lee, Assaf Naor
ICCD
2003
IEEE
109views Hardware» more  ICCD 2003»
16 years 1 months ago
Independent Test Sequence Compaction through Integer Programming
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
Petros Drineas, Yiorgos Makris