Sciweavers

28888 search results - page 5726 / 5778
» Computability and complexity in analysis
Sort
View
ISCAPDCS
2004
13 years 10 months ago
The Fat-Stack and Universal Routing in Interconnection Networks
This paper shows that a novel network called the fat-stack is universally efficient when adequate capacity distribution is provided and is suitable for use as an interconnection n...
Kevin F. Chen, Edwin Hsing-Mean Sha
KDID
2004
140views Database» more  KDID 2004»
13 years 10 months ago
Mining Formal Concepts with a Bounded Number of Exceptions from Transactional Data
We are designing new data mining techniques on boolean contexts to identify a priori interesting bi-sets (i.e., sets of objects or transactions associated to sets of attributes or ...
Jérémy Besson, Céline Robarde...
IPCO
2001
184views Optimization» more  IPCO 2001»
13 years 10 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
SPIESR
2004
143views Database» more  SPIESR 2004»
13 years 10 months ago
An entropy-based objective evaluation method for image segmentation
Accurate image segmentation is important for many image, video and computer vision applications. Over the last few decades, many image segmentation methods have been proposed. How...
Hui Zhang, Jason E. Fritts, Sally A. Goldman
ISCAPDCS
2003
13 years 10 months ago
N-Tuple Compression: A Novel Method for Compression of Branch Instruction Traces
Branch predictors and processor front-ends have been the focus of a number of computer architecture studies. Typically they are evaluated separately from other components using tr...
Aleksandar Milenkovic, Milena Milenkovic, Jeffrey ...
« Prev « First page 5726 / 5778 Last » Next »