Sciweavers

16091 search results - page 3198 / 3219
» Solving
Sort
View
CICLING
2011
Springer
13 years 10 days ago
Temporal Analysis of Sentiment Events - A Visual Realization and Tracking
In recent years, extraction of temporal relations for events that express sentiments has drawn great attention of the Natural Language Processing (NLP) research communities. In thi...
Dipankar Das, Anup Kumar Kolya, Asif Ekbal, Sivaji...
CIDR
2011
401views Algorithms» more  CIDR 2011»
13 years 10 days ago
DBease: Making Databases User-Friendly and Easily Accessible
Structured query language (SQL) is a classical way to access relational databases. Although SQL is powerful to query relational databases, it is rather hard for inexperienced user...
Guoliang Li, Ju Fan, Hao Wu, Jiannan Wang, Jianhua...
CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 10 days ago
Algorithms for Implicit Hitting Set Problems
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...
EDBT
2011
ACM
209views Database» more  EDBT 2011»
13 years 8 days ago
An optimal strategy for monitoring top-k queries in streaming windows
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...
Di Yang, Avani Shastri, Elke A. Rundensteiner, Mat...
EOR
2011
140views more  EOR 2011»
13 years 8 days ago
Compact bidding languages and supplier selection for markets with economies of scale and scope
Combinatorial auctions have been used in procurement markets with economies of scope. Preference elicitation is already a problem in single-unit combinatorial auctions, but it bec...
Martin Bichler, Stefan Schneider, Kemal Guler, Meh...
« Prev « First page 3198 / 3219 Last » Next »