Sciweavers

255 search results - page 50 / 51
» A new upper bound for the bipartite Ramsey problem
Sort
View
DBA
2006
236views Database» more  DBA 2006»
14 years 11 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...
CN
2007
116views more  CN 2007»
14 years 9 months ago
Scalability and security in biased many-to-one communication
In multicast communication, a source transmits the same content to a set of receivers. Current protocols for multicast follow a tree communication model which makes them scalable....
Francesc Sebé, Josep Domingo-Ferrer
76
Voted
STOC
1999
ACM
106views Algorithms» more  STOC 1999»
15 years 1 months ago
Scheduling in the Dark
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when ...
Jeff Edmonds
ISPD
1998
ACM
89views Hardware» more  ISPD 1998»
15 years 1 months ago
Filling and slotting: analysis and algorithms
In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CM...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Huij...
TMC
2011
149views more  TMC 2011»
14 years 4 months ago
Context-Based Network Estimation for Energy-Efficient Ubiquitous Wireless Connectivity
— Context information brings new opportunities for efficient and effective system resource management of mobile devices. In this work we focus on the use of context information t...
Ahmad Rahmati, Lin Zhong