Sciweavers

109 search results - page 14 / 22
» Large independent sets in regular graphs of large girth
Sort
View
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
14 years 11 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
116
Voted
PUK
2003
14 years 11 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
ECCC
2010
89views more  ECCC 2010»
14 years 9 months ago
Lower bounds for designs in symmetric spaces
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...
Noa Eidelstein, Alex Samorodnitsky
190
Voted
ICDE
2008
IEEE
203views Database» more  ICDE 2008»
15 years 11 months ago
Training Linear Discriminant Analysis in Linear Time
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
Deng Cai, Xiaofei He, Jiawei Han
70
Voted
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
15 years 10 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani