Sciweavers

13500 search results - page 2599 / 2700
» Improved analysis of D
Sort
View
113
Voted
WSDM
2010
ACM
213views Data Mining» more  WSDM 2010»
15 years 7 months ago
Corroborating Information from Disagreeing Views
We consider a set of views stating possibly conflicting facts. Negative facts in the views may come, e.g., from functional dependencies in the underlying database schema. We want ...
Alban Galland, Serge Abiteboul, Amélie Mari...
97
Voted
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
15 years 7 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...
110
Voted
PPOPP
2010
ACM
15 years 7 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
MICCAI
2009
Springer
15 years 7 months ago
A Spatio-temporal Atlas of the Human Fetal Brain with Application to Tissue Segmentation
Modeling and analysis of MR images of the early developing human brain is a challenge because of the transient nature of different tissue classes during brain growth. To address th...
Piotr A. Habas, Kio Kim, François Rousseau,...
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
15 years 7 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
« Prev « First page 2599 / 2700 Last » Next »