Sciweavers

8647 search results - page 545 / 1730
» The Container Selection Problem
Sort
View
PODS
1991
ACM
98views Database» more  PODS 1991»
15 years 10 months ago
Minimum and Maximum Predicates in Logic Programming
A novel approach is proposed for ezpresaing and computing eficienily a large cla88 of problem8, including jinding the shortest path in a graph, that were previously considered imp...
Sumit Ganguly, Sergio Greco, Carlo Zaniolo
LISA
2004
15 years 8 months ago
Gatekeeper: Monitoring Auto-Start Extensibility Points (ASEPs) for Spyware Management
Spyware is a rapidly spreading problem for PC users causing significant impact on system stability and privacy concerns. It attaches to extensibility points in the system to ensur...
Yi-Min Wang, Roussi Roussev, Chad Verbowski, Aaron...
WCE
2007
15 years 8 months ago
A Fast Multivariate Nearest Neighbour Imputation Algorithm
— Imputation of missing data is important in many areas, such as reducing non-response bias in surveys and maintaining medical documentation. Nearest neighbour (NN) imputation al...
Norman Solomon, Giles Oatley, Kenneth McGarry
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
15 years 7 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
SIAMDM
2008
97views more  SIAMDM 2008»
15 years 7 months ago
Large Nearly Regular Induced Subgraphs
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...
Noga Alon, Michael Krivelevich, Benny Sudakov