Sciweavers

5595 search results - page 849 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
MOBIHOC
2005
ACM
16 years 6 months ago
A distributed coordination framework for wireless sensor and actor networks
Wireless Sensor and Actor Networks (WSANs) are composed of a large number of heterogeneous nodes called sensors and actors. The collaborative operation of sensors enables the dist...
Tommaso Melodia, Dario Pompili, Vehbi C. Gungor, I...
ICDM
2003
IEEE
95views Data Mining» more  ICDM 2003»
15 years 12 months ago
Evolutionary Gabor Filter Optimization with Application to Vehicle Detection
Abstract—Despite the considerable amount of research work on the application of Gabor filters in pattern classification, their design and selection have been mostly done on a t...
Zehang Sun, George Bebis, Ronald Miller
190
Voted
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
15 years 5 months ago
Using data mining techniques to address critical information exchange needs in disaster affected public-private networks
Crisis Management and Disaster Recovery have gained immense importance in the wake of recent man and nature inflicted calamities. A critical problem in a crisis situation is how t...
Li Zheng, Chao Shen, Liang Tang, Tao Li, Steven Lu...
BMCBI
2010
138views more  BMCBI 2010»
15 years 6 months ago
UFFizi: a generic platform for ranking informative features
Background: Feature selection is an important pre-processing task in the analysis of complex data. Selecting an appropriate subset of features can improve classification or cluste...
Assaf Gottlieb, Roy Varshavsky, Michal Linial, Dav...
FOCS
2008
IEEE
16 years 1 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...