Sciweavers

1254 search results - page 164 / 251
» Making Hard Problems Harder
Sort
View
SIGCOMM
2005
ACM
14 years 3 months ago
Towards a global IP anycast service
IP anycast, with its innate ability to find nearby resources in a robust and efficient fashion, has long been considered an important means of service discovery. The growth of P2...
Hitesh Ballani, Paul Francis
SIGIR
2005
ACM
14 years 3 months ago
Boosted decision trees for word recognition in handwritten document retrieval
Recognition and retrieval of historical handwritten material is an unsolved problem. We propose a novel approach to recognizing and retrieving handwritten manuscripts, based upon ...
Nicholas R. Howe, Toni M. Rath, R. Manmatha
VEE
2005
ACM
149views Virtualization» more  VEE 2005»
14 years 3 months ago
Instrumenting annotated programs
Instrumentation is commonly used to track application behavior: to collect program profiles; to monitor component health and performance; to aid in component testing; and more. P...
Marina Biberstein, Vugranam C. Sreedhar, Bilha Men...
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
14 years 3 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
ISPD
2004
ACM
146views Hardware» more  ISPD 2004»
14 years 3 months ago
Power-aware clock tree planning
Modern processors and SoCs require the adoption of poweroriented design styles, due to the implications that power consumption may have on reliability, cost and manufacturability ...
Monica Donno, Enrico Macii, Luca Mazzoni