Sciweavers

1407 search results - page 201 / 282
» Using Use Cases in Executable Z
Sort
View
WWW
2007
ACM
16 years 4 months ago
Efficient search in large textual collections with redundancy
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
Jiangong Zhang, Torsten Suel
KDD
2007
ACM
186views Data Mining» more  KDD 2007»
16 years 4 months ago
Content-based document routing and index partitioning for scalable similarity-based searches in a large corpus
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
Deepavali Bhagwat, Kave Eshghi, Pankaj Mehra
IPSN
2010
Springer
15 years 10 months ago
KleeNet: discovering insidious interaction bugs in wireless sensor networks before deployment
Complex interactions and the distributed nature of wireless sensor networks make automated testing and debugging before deployment a necessity. A main challenge is to detect bugs ...
Raimondas Sasnauskas, Olaf Landsiedel, Muhammad Ha...
ISCA
2009
IEEE
136views Hardware» more  ISCA 2009»
15 years 10 months ago
Architectural core salvaging in a multi-core processor for hard-error tolerance
The incidence of hard errors in CPUs is a challenge for future multicore designs due to increasing total core area. Even if the location and nature of hard errors are known a prio...
Michael D. Powell, Arijit Biswas, Shantanu Gupta, ...
ECRTS
2007
IEEE
15 years 10 months ago
A Delay Composition Theorem for Real-Time Pipelines
Uniprocessor schedulability theory made great strides, in part, due to the simplicity of composing the delay of a job from the execution times of higher-priority jobs that preempt...
Praveen Jayachandran, Tarek F. Abdelzaher