Sciweavers

1901 search results - page 372 / 381
» Predicting Program Properties from
Sort
View
MOBIHOC
2009
ACM
15 years 11 months ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang
KDD
2006
ACM
272views Data Mining» more  KDD 2006»
15 years 11 months ago
YALE: rapid prototyping for complex data mining tasks
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Mar...
ICDE
2010
IEEE
251views Database» more  ICDE 2010»
15 years 10 months ago
Viewing a World of Annotations through AnnoVIP
The proliferation of electronic content has notably lead to the apparition of large corpora of interrelated structured documents (such as HTML and XML Web pages) and semantic annot...
Konstantinos Karanasos, Spyros Zoupanos
SODA
2010
ACM
189views Algorithms» more  SODA 2010»
15 years 8 months ago
Correlation Clustering with Noisy Input
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...
Claire Mathieu, Warren Schudy
EUROSYS
2007
ACM
15 years 7 months ago
Removing the memory limitations of sensor networks with flash-based virtual memory
Virtual memory has been successfully used in different domains to extend the amount of memory available to applications. We have adapted this mechanism to sensor networks, where,...
Andreas Lachenmann, Pedro José Marró...