Sciweavers

911 search results - page 24 / 183
» First Steps with a Rideable Computer
Sort
View
MPC
1992
Springer
235views Mathematics» more  MPC 1992»
13 years 12 months ago
Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given sequence. We do so in two steps. First, we invert...
Berry Schoenmakers
KR
2000
Springer
13 years 11 months ago
Satisfiability Algorithms and Finite Quantification
This paper makes three observations with regard to the application of algorithms such as wsat and relsat to problems of practical interest. First, we identify a specific calculati...
Matthew L. Ginsberg, Andrew J. Parkes
ESANN
2000
13 years 9 months ago
Bootstrapping Self-Organizing Maps to assess the statistical significance of local proximity
One of the attractive feature of Self-Organizing Maps (SOM) is the so-called "topological preservation property": observations that are close to each other in the input s...
Eric de Bodt, Marie Cottrell
APIN
2005
98views more  APIN 2005»
13 years 7 months ago
3-D Container Packing Heuristics
In this paper, we study the 3-D container packing problem. The problem is divided into box selection, space selection, box orientation and new space generation sub-problems. As a f...
Andrew Lim, Brian Rodrigues, Y. Yang
CARS
2004
13 years 9 months ago
Colonic polyp characterization and detection based on both morphological and texture features
In this paper, a method is presented for detection of colonic polyps using both morphological and texture features of the colon wall from the abdominal computed tomography (CT) im...
Zigang Wang, Lihong Li 0002, Joseph Anderson, Dona...