Sciweavers

1403 search results - page 256 / 281
» Set cover algorithms for very large datasets
Sort
View
CIB
2005
125views more  CIB 2005»
13 years 8 months ago
An On-Line Web Visualization System with Filtering and Clustering Graph
A Web graph refers to the graph that is used to represent relationships between Web pages in cyberspace, where a node represents a URL and an edge indicates a link between two URLs...
Wei Lai, Xiaodi Huang, Ronald Wibowo, Jiro Tanaka
CCE
2004
13 years 8 months ago
Optimization under uncertainty: state-of-the-art and opportunities
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncer...
Nikolaos V. Sahinidis
IJCV
2008
157views more  IJCV 2008»
13 years 8 months ago
Pairwise Matching of 3D Fragments Using Cluster Trees
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
Simon Winkelbach, Friedrich M. Wahl
MST
2010
98views more  MST 2010»
13 years 6 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
TVCG
2010
114views more  TVCG 2010»
13 years 6 months ago
Topology-Aware Evenly Spaced Streamline Placement
—This paper presents a new streamline placement algorithm that produces evenly spaced long streamlines while preserving topological features of a flow field. Singularities and se...
Keqin Wu, Zhanping Liu, Song Zhang, Robert J. Moor...