Sciweavers

4930 search results - page 708 / 986
» Learning minimal abstractions
Sort
View
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
16 years 2 days ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
ECCV
2010
Springer
16 years 1 days ago
3D Point Correspondence by Minimum Description Length in Feature Space
Abstract. Finding point correspondences plays an important role in automatically building statistical shape models from a training set of 3D surfaces. For the point correspondence ...
INDOCRYPT
2001
Springer
15 years 11 months ago
Mobile Agent Route Protection through Hash-Based Mechanisms
Abstract. One approach to secure mobile agent execution is restricting the agent route to trusted environments. A necessary condition for this approach to be practical is that the ...
Josep Domingo-Ferrer
HPCA
1998
IEEE
15 years 11 months ago
The Impact of Data Transfer and Buffering Alternatives on Network Interface Design
The explosive growth in the performance of microprocessors and networks has created a new opportunity to reduce the latency of fine-grain communication. Microprocessor clock speed...
Shubhendu S. Mukherjee, Mark D. Hill
ICC
2007
IEEE
143views Communications» more  ICC 2007»
15 years 10 months ago
DARA: Delay-Aware Routing Algorithm in a Hybrid Wireless-Optical Broadband Access Network (WOBAN)
Abstract-- Hybrid wireless-optical broadband access network (WOBAN) is a promising architecture for future network operations. Recently, the wireless part of WOBAN has been gaining...
Suman Sarkar, Hong-Hsu Yen, Sudhir S. Dixit, Biswa...