4850 search results - page 358 / 970 » Approximate Data Structures with Applications |
155
click to vote
ICRA
2010
IEEE
15 years 6 months ago
2010
IEEE
— We present a novel approach to build approximate maps of structured environments utilizing human motion and activity. Our approach uses data recorded with a data suit which is ...
230
click to vote
EUROSYS
2006
ACM
16 years 4 months ago
2006
ACM
Building content-based search tools for feature-rich data has been a challenging problem because feature-rich data such as audio recordings, digital images, and sensor data are in...
192
click to vote
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
209
click to vote
PPOPP
2009
ACM
16 years 8 months ago
2009
ACM
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
208
click to vote
IMC
2006
ACM
16 years 1 months ago
2006
ACM
A key step in the semantic analysis of network traffic is to parse the traffic stream according to the high-level protocols it contains. This process transforms raw bytes into s...