Sciweavers

2009 search results - page 329 / 402
» Dense Interest Points
Sort
View
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 8 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
WISE
2009
Springer
14 years 5 months ago
Start Trusting Strangers? Bootstrapping and Prediction of Trust
Web-based environments typically span interactions between humans and software services. The management and automatic calculation of trust are among the key challenges of the futur...
Florian Skopik, Daniel Schall, Schahram Dustdar
ALT
2009
Springer
14 years 5 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
INFOCOM
2009
IEEE
14 years 2 months ago
Double Mobility: Coverage of the Sea Surface with Mobile Sensor Networks
Abstract—We are interested in the sensor networks for scientific applications to cover and measure statistics on the sea surface. Due to flows and waves, the sensor nodes may g...
Ji Luo, Dan Wang, Qian Zhang
INFOCOM
2009
IEEE
14 years 2 months ago
Surface Coverage in Wireless Sensor Networks
—Coverage is a fundamental problem in Wireless Sensor Networks (WSNs). Existing studies on this topic focus on 2D ideal plane coverage and 3D full space coverage. In many real wo...
Ming-Chen Zhao, Jiayin Lei, Min-You Wu, Yunhuai Li...