Sciweavers

3096 search results - page 247 / 620
» The Generalized FITC Approximation
Sort
View
184
Voted
CIKM
2010
Springer
15 years 4 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
223
Voted
JCST
2010
122views more  JCST 2010»
15 years 4 months ago
Harmonic Field Based Volume Model Construction from Triangle Soup
Surface triangle meshes and volume data are two commonly used representations of digital geometry. Converting from triangle meshes to volume data is challenging, since triangle mes...
Chao-Hui Shen, Guo-Xin Zhang, Yu-Kun Lai, Shi-Min ...
TCOM
2010
67views more  TCOM 2010»
15 years 4 months ago
Receive antenna selection for unitary space-time modulation over semi-correlated Ricean channels
—Receive antenna selection for unitary space-time modulation (USTM) over semi-correlated Ricean fading channels is analyzed (this work generalizes that of Ma and Tepedelenlio˘gl...
Mahdi Ramezani, Mahdi Hajiaghayi, Chintha Tellambu...
TCS
2010
15 years 4 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
ICLP
2010
Springer
15 years 4 months ago
A Framework for Verification and Debugging of Resource Usage Properties: Resource Usage Verification
We present a framework for (static) verification of general resource usage program properties. The framework extends the criteria of correctness as the conformance of a program to ...
Pedro López-García, Luthfi Darmawan,...