Sciweavers

672 search results - page 35 / 135
» A General Solution to the Graph History Interaction Problem
Sort
View
MFCS
2005
Springer
14 years 1 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 8 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
MOBISYS
2011
ACM
12 years 10 months ago
AppJoy: personalized mobile application discovery
The explosive growth of the mobile application market has made it a significant challenge for the users to find interesting applications in crowded App Stores. To alleviate this...
Bo Yan, Guanling Chen
SCIA
2011
Springer
341views Image Analysis» more  SCIA 2011»
12 years 10 months ago
Interactive Image Segmentation Using Level Sets and Dempster-Shafer Theory of Evidence
Abstract. Variational frameworks based on level set methods are popular for the general problem of image segmentation. They combine different feature channels in an energy minimiz...
Björn Scheuermann, Bodo Rosenhahn
CAISE
2003
Springer
14 years 24 days ago
Path-Stamps: A Proposal for Enhancing Security of Location Tracking Applications
Location tracking technologies are penetrating increasingly in industrial environments. Several challenges arise when people or mobile assets are tracked. Security is one of the ma...
Ana Isabel González-Tablas Ferreres, Benjam...