Sciweavers

1201 search results - page 164 / 241
» Linear Probing and Graphs
Sort
View
IJCAI
2007
15 years 2 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
81
Voted
ECCC
2010
89views more  ECCC 2010»
15 years 22 days 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
96
Voted
CORR
2007
Springer
146views Education» more  CORR 2007»
15 years 19 days ago
Coding for Errors and Erasures in Random Network Coding
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
Ralf Koetter, Frank R. Kschischang
139
Voted
PAMI
2007
148views more  PAMI 2007»
15 years 4 days ago
Orthogonal Neighborhood Preserving Projections: A Projection-Based Dimensionality Reduction Technique
This paper considers the problem of dimensionality reduction by orthogonal projection techniques. The main feature of the proposed techniques is that they attempt to preserve both...
Effrosini Kokiopoulou, Yousef Saad
126
Voted
POPL
2012
ACM
13 years 8 months ago
Higher-order functional reactive programming in bounded space
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
Neelakantan R. Krishnaswami, Nick Benton, Jan Hoff...