Sciweavers

651 search results - page 15 / 131
» Index Sets and Universal Numberings
Sort
View
SPAA
2010
ACM
13 years 9 months ago
A universal construction for wait-free transaction friendly data structures
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
Phong Chuong, Faith Ellen, Vijaya Ramachandran
TSP
2010
13 years 4 months ago
Universal randomized switching
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
Suleyman Serdar Kozat, Andrew C. Singer
TKDE
2008
156views more  TKDE 2008»
13 years 9 months ago
A Framework for Mining Sequential Patterns from Spatio-Temporal Event Data Sets
Given a large spatio-temporal database of events, where each event consists of the fields event ID, time, location, and event type, mining spatio-temporal sequential patterns ident...
Yan Huang, Liqin Zhang, Pusheng Zhang
TIT
2008
84views more  TIT 2008»
13 years 9 months ago
Optimal Universal Schedules for Discrete Broadcast
In this paper we study the scenario in which a server sends dynamic data over a single broadcast channel to a number of passive clients. We consider the data to consist of discret...
Michael Langberg, Alexander Sprintson, Jehoshua Br...
ICDE
2005
IEEE
122views Database» more  ICDE 2005»
14 years 2 months ago
Autonomous Index Optimization in XML Databases
Abstract— Defining suitable indexes is a major task when optimizing a database. Usually, a human database administrator defines a set of indexes in the design phase of the data...
Beda Christoph Hammerschmidt, Martin Kempa, Volker...