Sciweavers

1480 search results - page 185 / 296
» Ants can solve constraint satisfaction problems
Sort
View
VLDB
2002
ACM
151views Database» more  VLDB 2002»
15 years 6 months ago
Preference SQL - Design, Implementation, Experiences
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
Werner Kießling, Gerhard Köstler
ACML
2009
Springer
15 years 10 months ago
Max-margin Multiple-Instance Learning via Semidefinite Programming
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
Yuhong Guo
ICC
2008
IEEE
161views Communications» more  ICC 2008»
16 years 1 months ago
Joint Power Control and Link Scheduling in Wireless Networks for Throughput Optimization
—This paper concerns the problem of finding the minimum-length TDMA frame of a power-controlled wireless network subject to traffic demands and SINR (signalto-interference-plus...
Liqun Fu, Soung Chang Liew, Jianwei Huang
TKDE
2008
108views more  TKDE 2008»
15 years 6 months ago
Grid Service Discovery with Rough Sets
The computational grid is rapidly evolving into a service-oriented computing infrastructure that facilitates resource sharing and large-scale problem solving over the Internet. Ser...
Maozhen Li, Bin Yu, Omer F. Rana, Zidong Wang
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 7 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson