Sciweavers

207 search results - page 13 / 42
» Run-Time Switching Between Total Order Algorithms
Sort
View
RECOMB
2010
Springer
13 years 5 months ago
Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives
In comparative genomics studies, finding a minimum length sequences of reversals, so called sorting by reversals, has been the topic of a huge literature. Since there are many mini...
Ghada Badr, Krister M. Swenson, David Sankoff
ESA
2003
Springer
106views Algorithms» more  ESA 2003»
14 years 19 days ago
Improved Competitive Guarantees for QoS Buffering
We consider a network providing Differentiated Services (DiffServ), which allow Internet Service Providers (ISP’s) to offer different levels of Quality of Service (QoS) to diffe...
Alexander Kesselman, Yishay Mansour, Rob van Stee
MICAI
2005
Springer
14 years 27 days ago
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
Edgar Chávez, Karina Figueroa, Gonzalo Nava...
CGO
2007
IEEE
14 years 1 months ago
Exploiting Narrow Accelerators with Data-Centric Subgraph Mapping
The demand for high performance has driven acyclic computation accelerators into extensive use in modern embedded and desktop architectures. Accelerators that are ideal from a sof...
Amir Hormati, Nathan Clark, Scott A. Mahlke
SC
2003
ACM
14 years 19 days ago
SCALLOP: A Highly Scalable Parallel Poisson Solver in Three Dimensions
SCALLOP is a highly scalable solver and library for elliptic partial differential equations on regular block-structured domains. SCALLOP avoids high communication overheads algor...
Gregory T. Balls, Scott B. Baden, Phillip Colella