2107 search results - page 116 / 422 » Computing Small Search Numbers in Linear Time |
116
Voted
IVC
2000
15 years 3 months ago
2000
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
106
Voted
WCNC
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract—Realization of all-digital baseband receiver processing for multi-Gigabit communication requires analog-to-digital converters(ADCs) of sufficient rate and output resolu...
177
Voted
COMGEO
2006
ACM
15 years 3 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
106
click to vote
ICPP
2007
IEEE
15 years 9 months ago
2007
IEEE
—By combining an unstructured protocol with a DHT-based global index, hybrid peer-to-peer (P2P) improves search efficiency in terms of query recall and response time. The major c...
125
Voted
ANOR
2008
15 years 3 months ago
2008
Abstract Column generation techniques have become a widely used technique to successfully solve large (integer) linear programs. One of the keys to obtaining a practically efficien...