Sciweavers

5055 search results - page 32 / 1011
» Relative Timing
Sort
View
DAWAK
2009
Springer
14 years 1 months ago
Mining Violations to Relax Relational Database Constraints
Frequent constraint violations on the data stored in a database may suggest that the semantics of the represented reality is changing. In this work we propose a methodology and a t...
Mirjana Mazuran, Elisa Quintarelli, Rosalba Rossat...
ESA
1998
Springer
145views Algorithms» more  ESA 1998»
14 years 22 days ago
Moving-Target TSP and Related Problems
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
Christopher S. Helvig, Gabriel Robins, Alexander Z...
NIPS
1994
13 years 9 months ago
The Electrotonic Transformation: a Tool for Relating Neuronal Form to Function
The spatial distribution and time course of electrical signals in neurons have important theoretical and practical consequences. Because it is difficult to infer how neuronal form...
Nicholas T. Carnevale, Kenneth Y. Tsai, Brenda J. ...
CORR
1999
Springer
145views Education» more  CORR 1999»
13 years 8 months ago
Subgraph Isomorphism in Planar Graphs and Related Problems
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
David Eppstein
SAC
2008
ACM
13 years 8 months ago
Output-sensitive algorithms for Tukey depth and related problems
The Tukey depth (Tukey 1975) of a point p with respect to a finite set S of points is the minimum number of elements of S contained in any closed halfspace that contains p. Algori...
David Bremner, Dan Chen, John Iacono, Stefan Lange...