Sciweavers

724 search results - page 84 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
ECCV
2008
Springer
16 years 1 months ago
Pose Priors for Simultaneously Solving Alignment and Correspondence
Abstract. Estimating a camera pose given a set of 3D-object and 2Dimage feature points is a well understood problem when correspondences are given. However, when such correspondenc...
Francesc Moreno-Noguer, Vincent Lepetit, Pascal Fu...
DCOSS
2005
Springer
15 years 5 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
INFOCOM
2002
IEEE
15 years 4 months ago
Optimal Configuration of OSPF Aggregates
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalak...
AMW
2010
15 years 1 months ago
Multiresolution Cube Estimators for Sensor Network Aggregate Queries
In this work we present in-network techniques to improve the efficiency of spatial aggregate queries. Such queries are very common in a sensornet setting, demanding more targeted t...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
ISVLSI
2003
IEEE
97views VLSI» more  ISVLSI 2003»
15 years 5 months ago
Q-Tree: A New Iterative Improvement Approach for Buffered Interconnect Optimization
The “chicken-egg” dilemma between VLSI interconnect timing optimization and delay calculation suggests an iterative approach. We separate interconnect timing transformation as...
Andrew B. Kahng, Bao Liu