Sciweavers

150 search results - page 20 / 30
» Solving the Rectangular assignment problem and applications
Sort
View
NIPS
2007
13 years 8 months ago
Spatial Latent Dirichlet Allocation
In recent years, the language model Latent Dirichlet Allocation (LDA), which clusters co-occurring words into topics, has been widely applied in the computer vision field. Howeve...
Xiaogang Wang, Eric Grimson
EAAI
2008
101views more  EAAI 2008»
13 years 7 months ago
A global constraint for total weighted completion time for cumulative resources
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
András Kovács, J. Christopher Beck
IAT
2009
IEEE
14 years 2 months ago
Distributed Constraint Optimization for Large Teams of Mobile Sensing Agents
Abstract. A team of mobile sensors can be used for coverage of targets in different environments. The dynamic nature of such an application requires the team of agents to adjust th...
Roie Zivan, Robin Glinton, Katia P. Sycara
CIKM
2007
Springer
14 years 1 months ago
Structure and semantics for expressive text kernels
Several problems in text categorization are too hard to be solved by standard bag-of-words representations. Work in kernel-based learning has approached this problem by (i) consid...
Stephan Bloehdorn, Alessandro Moschitti
FOCS
2002
IEEE
14 years 10 days ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich