Sciweavers

16188 search results - page 2668 / 3238
» The Optimal PAC Algorithm
Sort
View
209
Voted
CPM
2008
Springer
143views Combinatorics» more  CPM 2008»
15 years 8 months ago
A Black Box for Online Approximate Pattern Matching
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
Raphaël Clifford, Klim Efremenko, Benny Porat...
CVPR
2008
IEEE
15 years 8 months ago
Classification via semi-Riemannian spaces
In this paper, we develop a geometric framework for linear or nonlinear discriminant subspace learning and classification. In our framework, the structures of classes are conceptu...
Deli Zhao, Zhouchen Lin, Xiaoou Tang
DCOSS
2008
Springer
15 years 8 months ago
Improving the Data Delivery Latency in Sensor Networks with Controlled Mobility
Unlike traditional multihop forwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more...
Ryo Sugihara, Rajesh K. Gupta
FITRAMEN
2008
15 years 8 months ago
A Fair and Dynamic Load-Balancing Mechanism
The current data network scenario makes Traffic Engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in more var...
Federico Larroca, Jean-Louis Rougier
154
Voted
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
15 years 8 months ago
Improved Rounding for Parallel Repeated Unique Games
We show a tight relation between the behavior of unique games under parallel repetition and their semidefinite value. Let G be a unique game with alphabet size k. Suppose the semid...
David Steurer
« Prev « First page 2668 / 3238 Last » Next »