Sciweavers

400 search results - page 42 / 80
» Derandomization and Distinguishing Complexity
Sort
View
CVPR
2006
IEEE
16 years 4 months ago
Learning Boosted Asymmetric Classifiers for Object Detection
Object detection can be posted as those classification tasks where the rare positive patterns are to be distinguished from the enormous negative patterns. To avoid the danger of m...
Xinwen Hou, Cheng-Lin Liu, Tieniu Tan
ECCV
2008
Springer
16 years 3 months ago
Passive Reflectometry
Different materials reflect light in different ways, so reflectance is a useful surface descriptor. Existing systems for measuring reflectance are cumbersome, however, and although...
Fabiano Romeiro, Yuriy Vasilyev, Todd Zickler
ICIP
2005
IEEE
16 years 3 months ago
Visual tracking via efficient kernel discriminant subspace learning
Robustly tracking moving objects in video sequences is one of the key problems in computer vision. In this paper we introduce a computationally efficient nonlinear kernel learning...
Chunhua Shen, Anton van den Hengel, Michael J. Bro...
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
16 years 2 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
16 years 2 months ago
Identifying meaningful return information for XML keyword search
Keyword search enables web users to easily access XML data without the need to learn a structured query language and to study possibly complex data schemas. Existing work has addr...
Ziyang Liu, Yi Chen