Sciweavers

1458 search results - page 189 / 292
» Monads for incremental computing
Sort
View
135
Voted
ICPR
2010
IEEE
15 years 9 months ago
On-Line Random Naive Bayes for Tracking
—Randomized learning methods (i.e., Forests or Ferns) have shown excellent capabilities for various computer vision applications. However, it was shown that the tree structure in...
Martin Godec, Christian Leistner, Amir Saffari, Ho...
146
Voted
IEEESCC
2005
IEEE
15 years 9 months ago
Satisfying Database Service Level Agreements while Minimizing Cost through Storage QoS
The emerging paradigms of service oriented architectures and utility-based computing have the potential to greatly reduce the cost of data management. Data management service prov...
Frederick Reiss, Tapas Kanungo
FSE
2005
Springer
119views Cryptology» more  FSE 2005»
15 years 9 months ago
The Poly1305-AES Message-Authentication Code
Poly1305-AES is a state-of-the-art message-authentication code suitable for a wide variety of applications. Poly1305-AES computes a 16-byte authenticator of a variable-length messa...
Daniel J. Bernstein
126
Voted
ICDCS
2003
IEEE
15 years 9 months ago
Compiler Scheduling of Mobile Agents for Minimizing Overheads
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
Xiaotong Zhuang, Santosh Pande
137
Voted
BIRTHDAY
2003
Springer
15 years 9 months ago
Comet in Context
Combinatorial optimization problems naturally arise in many application areas, including logistics, manufacturing, supplychain management, and resource allocation. They often give...
Laurent Michel, Pascal Van Hentenryck