Sciweavers

4865 search results - page 704 / 973
» The Complexity of Graph Connectivity
Sort
View
TKDE
2008
121views more  TKDE 2008»
15 years 4 months ago
Schema Matching Using Interattribute Dependencies
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
Jaewoo Kang, Jeffrey F. Naughton
JCP
2007
126views more  JCP 2007»
15 years 4 months ago
ADE: Utility Driven Self-management in a Networked Environment
ADE, autonomic distributed environment, is a system which engages autonomic elements to automatically take an existing centralized application and distribute it across available re...
Debzani Deb, M. Muztaba Fuad, Michael J. Oudshoorn
CORR
2002
Springer
79views Education» more  CORR 2002»
15 years 4 months ago
Optimally cutting a surface into a disk
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...
Jeff Erickson, Sariel Har-Peled
TOG
2002
133views more  TOG 2002»
15 years 4 months ago
Interactive motion generation from examples
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...
Okan Arikan, David A. Forsyth
PR
2007
189views more  PR 2007»
15 years 4 months ago
Information cut for clustering using a gradient descent approach
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...