Sciweavers

2056 search results - page 142 / 412
» time 2000
Sort
View
159
Voted
COMPGEOM
2000
ACM
15 years 9 months ago
When crossings count - approximating the minimum spanning tree
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
Sariel Har-Peled, Piotr Indyk
142
Voted
DAC
2000
ACM
15 years 9 months ago
Watermarking while preserving the critical path
In many modern designs, timing is either a key optimization goal and/or a mandatory constraint. We propose the first intellectual property protection technique using watermarking ...
Seapahn Meguerdichian, Miodrag Potkonjak
IUI
2000
ACM
15 years 9 months ago
Data exploration across temporal contexts
The ability to quickly explore and compare multiple scenarios is an important component of exploratory data analysis. Yet today’s interfaces cannot represent alternative explora...
Mark Derthick, Steven F. Roth
MOBICOM
2000
ACM
15 years 9 months ago
W-mail: an electronic mail system for wearable computing environments
This paper describes an e-mail system for wearable computing environments. In this system, we extend the conventional mail format and the server/client(browser) architecture by co...
Hirotaka Ueda, Masahiko Tsukamoto, Shojiro Nishio
158
Voted
CAISE
2000
Springer
15 years 9 months ago
Temporally Faithful Execution of Business Transactions
Serializability is a prominent correctness criterion for an interleaved execution of concurrent transactions. Serializability guarantees that the interleaved execution of concurre...
Werner Obermair, Michael Schrefl