Sciweavers

2996 search results - page 131 / 600
» Numberings and Randomness
Sort
View
INFOCOM
2007
IEEE
15 years 11 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
ISMIR
2005
Springer
151views Music» more  ISMIR 2005»
15 years 11 months ago
Markov Random Fields and Maximum Entropy Modeling for Music Information Retrieval
Music information retrieval is characterized by a number of various user information needs. Systems are being developed that allow searchers to find melodies, rhythms, genres, an...
Jeremy Pickens, Costas S. Iliopoulos
INFOCOM
2000
IEEE
15 years 9 months ago
End-to-End Congestion Control Schemes: Utility Functions, Random Losses and ECN Marks
We present a framework for designing end-to-end congestion control schemes in a network where each user may have a different utility function and may experience non-congestion-re...
Srisankar S. Kunniyur, Rayadurgam Srikant
ITC
1995
IEEE
104views Hardware» more  ITC 1995»
15 years 9 months ago
Synthesis of Mapping Logic for Generating Transformed Pseudo-Random Patterns for BIST
During built-in self-test (BIST), the set of patterns generated by a pseudo-random pattern generator may not provide a sufficiently high fault coverage. This paper presents a new ...
Nur A. Touba, Edward J. McCluskey
DCG
2008
104views more  DCG 2008»
15 years 5 months ago
Finding the Homology of Submanifolds with High Confidence from Random Samples
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
Partha Niyogi, Stephen Smale, Shmuel Weinberger