Sciweavers

1133 search results - page 138 / 227
» Basics of Graph Cuts
Sort
View
143
Voted
TOG
2002
133views more  TOG 2002»
15 years 3 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
109
Voted
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
16 years 4 months ago
On proximity oblivious testing
We initiate a systematic study of a special type of property testers. These testers consist of repeating a basic test for a number of times that depends on the proximity parameter...
Oded Goldreich, Dana Ron
116
Voted
ADBIS
2005
Springer
78views Database» more  ADBIS 2005»
15 years 9 months ago
Schema-based Query Optimization for XQuery Queries
XQuery is widely used for querying XML documents. Within this paper, we examine optimization rules for XQuery queries that exploit type information of the input XML document given ...
Sven Groppe, Stefan Böttcher
124
Voted
IPPS
1998
IEEE
15 years 8 months ago
Measuring the Vulnerability of Interconnection Networks in Embedded Systems
Studies of the fault-tolerance of graphs have tended to largely concentrate on classical graph connectivity. This measure is very basic, and conveys very little information for des...
Vijay Lakamraju, Zahava Koren, Israel Koren, C. Ma...
106
Voted
GD
2006
Springer
15 years 7 months ago
Integrating Edge Routing into Force-Directed Layout
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...
Tim Dwyer, Kim Marriott, Michael Wybrow