Sciweavers

4137 search results - page 713 / 828
» On the number of matchings of a tree
Sort
View
JGAA
2000
179views more  JGAA 2000»
13 years 7 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
IJCV
2002
148views more  IJCV 2002»
13 years 7 months ago
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
Stereo matching is one of the most active research areas in computer vision. While a large number of algorithms for stereo correspondence have been developed, relatively little wo...
Daniel Scharstein, Richard Szeliski
AROBOTS
1999
87views more  AROBOTS 1999»
13 years 7 months ago
Dynamics of a Classical Conditioning Model
Abstract. Classical conditioning is a basic learning mechanism in animals and can be found in almost all organisms. If we want to construct robots with abilities matching those of ...
Christian Balkenius
IPM
2002
102views more  IPM 2002»
13 years 7 months ago
Problems of music information retrieval in the real world
Although a substantial number of research projects have addressed music information retrieval over the past three decades, the field is still very immature. Few of these projects ...
Donald Byrd, Tim Crawford
JCO
2002
77views more  JCO 2002»
13 years 7 months ago
Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs
SONET(SynchronousOpticalNETworks)add-dropmultiplexers(ADMs)arethedominantcostfactor in the WDM(Wavelength Division Multiplexing)/SONET rings. The number of SONET ADMs required by a...
Gruia Calinescu, Peng-Jun Wan