Sciweavers

2314 search results - page 404 / 463
» Minimal Partitions of a Graph
Sort
View
MICCAI
2005
Springer
16 years 4 months ago
Brain Surface Parameterization Using Riemann Surface Structure
Abstract. We develop a general approach that uses holomorphic 1forms to parameterize anatomical surfaces with complex (possibly branching) topology. Rather than evolve the surface ...
Yalin Wang, Xianfeng Gu, Kiralee M. Hayashi, Tony ...
KDD
2005
ACM
170views Data Mining» more  KDD 2005»
16 years 3 months ago
Parallel mining of closed sequential patterns
Discovery of sequential patterns is an essential data mining task with broad applications. Among several variations of sequential patterns, closed sequential pattern is the most u...
Shengnan Cong, Jiawei Han, David A. Padua
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
16 years 3 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
243
Voted
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
16 years 3 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
EUROSYS
2006
ACM
16 years 17 days ago
Database replication policies for dynamic content applications
The database tier of dynamic content servers at large Internet sites is typically hosted on centralized and expensive hardware. Recently, research prototypes have proposed using d...
Gokul Soundararajan, Cristiana Amza, Ashvin Goel