Sciweavers

1299 search results - page 120 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
NECO
2008
112views more  NECO 2008»
14 years 10 months ago
Second-Order SMO Improves SVM Online and Active Learning
Iterative learning algorithms that approximate the solution of support vector machines (SVMs) have two potential advantages. First, they allow for online and active learning. Seco...
Tobias Glasmachers, Christian Igel
PERCOM
2008
ACM
15 years 9 months ago
Automatic form filling on mobile devices
Filling out forms of web based services on mobile devices is a very time consuming and frustrating task for users because of the limited text input capabilities. This is a critica...
Enrico Rukzio, Chie Noda, Alexander De Luca, John ...
NIPS
2008
14 years 11 months ago
Clustering via LP-based Stabilities
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
Nikos Komodakis, Nikos Paragios, Georgios Tziritas
INFOCOM
2007
IEEE
15 years 4 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
ICCV
1999
IEEE
15 years 2 months ago
Geodesic Active Regions for Supervised Texture Segmentation
This paper presents a novel variational method for supervised texture segmentation. The textured feature space is generated by filtering the given textured images using isotropic ...
Nikos Paragios, Rachid Deriche