Sciweavers

5595 search results - page 881 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
COMPUTER
1999
69views more  COMPUTER 1999»
15 years 6 months ago
Scientific Components Are Coming
abstract mathematical or physical statement, not something specific. The way scientific programmers most frequently verify that their programs are correct is to examine their resul...
Paul F. Dubois
INFOCOM
2012
IEEE
13 years 9 months ago
DEAR: Delay-bounded Energy-constrained Adaptive Routing in wireless sensor networks
— Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with...
Shi Bai, Weiyi Zhang, Guoliang Xue, Jian Tang, Cho...
ICCV
2007
IEEE
16 years 8 months ago
Articulated Shape Matching by Robust Alignment of Embedded Representations
In this paper we propose a general framework to solve the articulated shape matching problem, formulated as finding point-to-point correspondences between two shapes represented b...
Diana Mateus, Fabio Cuzzolin, Radu Horaud, Edmond ...
ICCV
2003
IEEE
16 years 8 months ago
Spectral Partitioning for Structure from Motion
We propose a spectral partitioning approach for large-scale optimization problems, specifically structure from motion. In structure from motion, partitioning methods reduce the pr...
Drew Steedly, Irfan A. Essa, Frank Dellaert
WWW
2007
ACM
16 years 7 months ago
Identifying and discriminating between web and peer-to-peer traffic in the network core
Traffic classification is the ability to identify and categorize network traffic by application type. In this paper, we consider the problem of traffic classification in the netwo...
Jeffrey Erman, Anirban Mahanti, Martin F. Arlitt, ...