Sciweavers

943 search results - page 184 / 189
» How should data structures and algorithms be taught
Sort
View
PR
2006
78views more  PR 2006»
13 years 7 months ago
Similarity-based analysis for large networks of ultra-low resolution sensors
By analyzing the similarities between bit streams coming from a network of motion detectors, we can recover the network geometry and discover structure in the human behavior being...
Christopher Richard Wren, David C. Minnen, Sriniva...
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
14 years 1 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
ICDE
2008
IEEE
112views Database» more  ICDE 2008»
14 years 9 months ago
XML Index Recommendation with Tight Optimizer Coupling
XML database systems are expected to handle increasingly complex queries over increasingly large and highly structured XML databases. An important problem that needs to be solved ...
Iman Elghandour, Ashraf Aboulnaga, Daniel C. Zilio...
CCS
2007
ACM
14 years 2 months ago
Managing RBAC states with transitive relations
In this paper, we study the maintenance of role-based access control (RBAC) models in database environments using transitive closure relations. In particular, the algorithms that ...
Chaoyi Pang, David P. Hansen, Anthony J. Maeder
JUCS
2006
117views more  JUCS 2006»
13 years 7 months ago
Resource Efficient Maintenance of Wireless Network Topologies
Abstract: Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remain. However if th...
Tamás Lukovszki, Christian Schindelhauer, K...