Sciweavers

881 search results - page 126 / 177
» Solving satisfiability problems with preferences
Sort
View
AAAI
2012
13 years 5 months ago
Transfer Learning in Collaborative Filtering with Uncertain Ratings
To solve the sparsity problem in collaborative filtering, researchers have introduced transfer learning as a viable approach to make use of auxiliary data. Most previous transfer...
Weike Pan, Evan Wei Xiang, Qiang Yang
QUESTA
2010
112views more  QUESTA 2010»
15 years 1 months ago
Admission control for a multi-server queue with abandonment
In a M/M/N+M queue, when there are many customers waiting, it may be preferable to reject a new arrival rather than risk that arrival later abandoning without receiving service. O...
Yasar Levent Koçaga, Amy R. Ward
UIST
1997
ACM
15 years 6 months ago
Interactive Beautification: A Technique for Rapid Geometric Design
We propose interactive beautification, a technique for rapid geometric design, and introduce the technique and its algorithm with a prototype system Pegasus. The motivation is to ...
Takeo Igarashi, Satoshi Matsuoka, Sachiko Kawachiy...
FSTTCS
2009
Springer
15 years 7 months ago
Bounded Size Graph Clustering with Applications to Stream Processing
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, De...
JALC
2006
143views more  JALC 2006»
15 years 3 months ago
Quality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach
Automated Web Service Composition has gained a significant momentum in facilitating fast and efficient formation of business-to-business collaborations where an important objectiv...
Oscar H. Ibarra, Bala Ravikumar, Cagdas Evren Gere...