Sciweavers

131 search results - page 21 / 27
» A General Method for Reducing the Complexity of Relational I...
Sort
View
ZUM
2000
Springer
13 years 11 months ago
Retrenchment, Refinement, and Simulation
: Retrenchment is introduced as a liberalisation of refinement intended to address some of the shortcomings of refinement as sole means of progressing from simple abstract models t...
Richard Banach, Michael Poppleton
JIRS
2007
120views more  JIRS 2007»
13 years 7 months ago
Optimal Camera Placement for Automated Surveillance Tasks
— Today, there are many opportunities to create vision-based intelligent systems that are human-centric. This is a very rich area because humans are very complex, and the number ...
Robert Bodor, Andrew Drenner, Paul R. Schrater, Ni...
BROADNETS
2006
IEEE
14 years 1 months ago
Graded Channel Reservation with Path Switching in Ultra High Capacity Networks
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
Reuven Cohen, Niloofar Fazlollahi, David Starobins...
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
14 years 8 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
ASPLOS
2008
ACM
13 years 9 months ago
Optimistic parallelism benefits from data partitioning
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
Milind Kulkarni, Keshav Pingali, Ganesh Ramanaraya...