Sciweavers

113 search results - page 9 / 23
» Simpler is also better in approximating fixed points
Sort
View
TCAD
2002
72views more  TCAD 2002»
13 years 7 months ago
Wire width planning for interconnect performance optimization
Abstract--In this paper, we study wire width planning for interconnect performance optimization in an interconnect-centric design flow. We first propose some simplified, yet near-o...
Jason Cong, David Zhigang Pan
CIKM
2000
Springer
13 years 12 months ago
Dimensionality Reduction and Similarity Computation by Inner Product Approximations
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
Ömer Egecioglu, Hakan Ferhatosmanoglu
ICCV
1999
IEEE
14 years 9 months ago
Differential Matching Constraints
We introduce a finite difference expansion for closely spaced cameras in projective vision, and use it to derive differential analogues of the finite-displacement projective match...
Bill Triggs
WIOPT
2006
IEEE
14 years 1 months ago
Scheduling sensor activity for point information coverage in wireless sensor networks
Abstract— An important application of wireless sensor networks is to perform the monitoring missions, for example, to monitor some targets of interests at all times. Sensors are ...
Bang Wang, Kee Chaing Chua, Vikram Srinivasan, Wei...
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
14 years 7 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount