Sciweavers

1225 search results - page 141 / 245
» The Instance Complexity Conjecture
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 9 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
CAISE
2006
Springer
14 years 29 days ago
Compliant and Flexible Business Processes with Business Rules
When modeling business processes, we often implicity think of internal business policies and external regulations. Yet to date, little attention is paid to avoid hard-coding polici...
Stijn Goedertier, Jan Vanthienen
ICCV
2003
IEEE
14 years 11 months ago
3D Tracking = Classification + Interpolation
Hand gestures are examples of fast and complex motions. Computers fail to track these in fast video, but sleight of hand fools humans as well: what happens too quickly we just can...
Carlo Tomasi, Slav Petrov, Arvind Sastry
ECCV
2008
Springer
14 years 11 months ago
Feature Correspondence Via Graph Matching: Models and Global Optimization
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
Lorenzo Torresani, Vladimir Kolmogorov, Carsten Ro...
SIGMOD
2009
ACM
158views Database» more  SIGMOD 2009»
14 years 9 months ago
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Whether beloved or despised, XML Schema is momentarily the only industrially accepted schema language for XML and is unlikely to become obsolete any time soon. Nevertheless, many ...
Geert Jan Bex, Wouter Gelade, Wim Martens, Frank N...