706 search results - page 64 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
AINA
2004
IEEE
13 years 11 months ago
2004
IEEE
The routing algorithms for multimedia communication should use for routing more than one QoS parameter. This is because new services such as video on demand and remote meeting sys...
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
IJCAI
2001
13 years 9 months ago
2001
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...
JMLR
2010
13 years 2 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...