Sciweavers

413 search results - page 49 / 83
» On Solving Geometric Optimization Problems Using Shortest Pa...
Sort
View
SOFSEM
2000
Springer
13 years 11 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
ESA
2011
Springer
231views Algorithms» more  ESA 2011»
12 years 7 months ago
Distribution-Aware Compressed Full-Text Indexes
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
Paolo Ferragina, Jouni Sirén, Rossano Ventu...
CN
2007
154views more  CN 2007»
13 years 7 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
COMCOM
2004
92views more  COMCOM 2004»
13 years 7 months ago
Genetic algorithms for multiple multicast on WDM ring network
The optimal multiple multicast problem (OMMP) on wavelength division multiplexing ring networks without wavelength conversion is considered in this paper. When the physical networ...
Der-Rong Din
ML
2008
ACM
13 years 7 months ago
Large margin vs. large volume in transductive learning
Abstract. We consider a large volume principle for transductive learning that prioritizes the transductive equivalence classes according to the volume they occupy in hypothesis spa...
Ran El-Yaniv, Dmitry Pechyony, Vladimir Vapnik