Sciweavers

2588 search results - page 170 / 518
» Applications of Kolmogorov complexity to computable model th...
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 2 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
EMSOFT
2004
Springer
15 years 7 months ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras
85
Voted
JDM
2000
128views more  JDM 2000»
15 years 1 months ago
Distributed Database Design for Mobile Geographical Applications
Advanced Traveler Information Systems (ATIS) require e cient information retrieval and updating in a dynamic environment at di erent geographical scales. ATIS applications are use...
Manhoi Choy, Mei-Po Kwan, Hong Va Leong
CHI
2010
ACM
15 years 8 months ago
Graphemes: self-organizing shape-based clustered structures for network visualisations
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
Ross Shannon, Aaron J. Quigley, Paddy Nixon
FORTE
2008
15 years 3 months ago
An SMT Approach to Bounded Reachability Analysis of Model Programs
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
Margus Veanes, Nikolaj Bjørner, Alexander R...