Sciweavers

2069 search results - page 262 / 414
» Linear time algorithms for Clobber
Sort
View
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 10 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
WG
1993
Springer
15 years 10 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
ENDM
2008
90views more  ENDM 2008»
15 years 6 months ago
On cliques of Helly Circular-arc Graphs
A circular-arc graph is the intersection graph of a set of arcs on the circle. It is a Helly circular-arc graph if it has a Helly model, where every maximal clique is the set of a...
Min Chih Lin, Ross M. McConnell, Francisco J. Soul...
ICAI
2008
15 years 8 months ago
Mapping of Activity Recognition as a Distributed Inference Problem in Sensor Network
- This paper presents a distributed model for detecting Activities of Daily Living (ADLs) in a home setting. We consider an environment where household devices and utensils are aug...
Md. Kamrul Hasan, Husne Ara Rubaiyeat, Young-Koo L...
ECCV
2008
Springer
16 years 8 months ago
Higher Dimensional Affine Registration and Vision Applications
Abstract. Affine registration has a long and venerable history in computer vision literature, and extensive work have been done for affine registrations in IR2 and IR3 . In this pa...
Yu-Tseh Chi, S. M. Nejhum Shahed, Jeffrey Ho, Ming...