Sciweavers

914 search results - page 154 / 183
» Analysis of Heuristic Synergies
Sort
View
MST
2010
98views more  MST 2010»
14 years 10 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
217views more  TVCG 2010»
14 years 10 months ago
How Information Visualization Novices Construct Visualizations
—It remains challenging for information visualization novices to rapidly construct visualizations during exploratory data analysis. We conducted an exploratory laboratory study i...
Lars Grammel, Melanie Tory, Margaret-Anne D. Store...
VC
2010
160views more  VC 2010»
14 years 10 months ago
A lightweight approach to repairing digitized polygon meshes
Abstract When designing novel algorithms for geometric processing and analysis, researchers often assume that the input conforms to several requirements. On the other hand, polygon...
Marco Attene
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 10 months ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...
ICDM
2010
IEEE
193views Data Mining» more  ICDM 2010»
14 years 9 months ago
Supervised Link Prediction Using Multiple Sources
Link prediction is a fundamental problem in social network analysis and modern-day commercial applications such as Facebook and Myspace. Most existing research approaches this pro...
Zhengdong Lu, Berkant Savas, Wei Tang, Inderjit S....