Sciweavers

6409 search results - page 1046 / 1282
» A Computational Algorithm for Origami Design
Sort
View
IMC
2004
ACM
15 years 12 months ago
Robust synchronization of software clocks across the internet
Accurate, reliable timestamping which is also convenient and inexpensive is needed in many important areas including real-time network applications and network measurement. Recent...
Darryl Veitch, Satish Babu Korada, Attila Pá...
MM
2004
ACM
99views Multimedia» more  MM 2004»
15 years 12 months ago
Locality preserving clustering for image database
It is important and challenging to make the growing image repositories easy to search and browse. Image clustering is a technique that helps in several ways, including image data ...
Xin Zheng, Deng Cai, Xiaofei He, Wei-Ying Ma, Xuey...
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 11 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
WCRE
1999
IEEE
15 years 10 months ago
Experiments with Clustering as a Software Remodularization Method
As valuable software systems get old, reverse engineering becomes more and more important to the companies that have to maintain the code. Clustering is a key activity in reverse ...
Nicolas Anquetil, Timothy Lethbridge
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 10 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
« Prev « First page 1046 / 1282 Last » Next »