Sciweavers

6274 search results - page 419 / 1255
» From query complexity to computational complexity
Sort
View
SAC
2004
ACM
16 years 7 days ago
Frequent free tree discovery in graph data
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
Ulrich Rückert, Stefan Kramer
WSCG
2004
149views more  WSCG 2004»
15 years 8 months ago
Depth Detection Through Interpolation Functions: A New Method
There are some different methods used for depth perception. In this paper, a new method for the depth perception, by using a single camera based on an interpolation, is introduced...
Mahdi Mirzabaki
ISMB
1993
15 years 8 months ago
Representations of Metabolic Knowledge
Construction of electronic repositories of metabolic information is an increasingly active area of research. Encoding detailed knowledge of a complex biological domain requires ï¬...
Peter D. Karp, Monica Riley
NETWORKS
2011
15 years 1 months ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
ECCC
2011
217views ECommerce» more  ECCC 2011»
14 years 10 months ago
ReachFewL = ReachUL
We show that two complexity classes introduced about two decades ago are equal. ReachUL is the class of problems decided by nondeterministic log-space machines which on every inpu...
Brady Garvin, Derrick Stolee, Raghunath Tewari, N....