Sciweavers

3367 search results - page 450 / 674
» Incremental assignment problem
Sort
View
FECS
2006
80views Education» more  FECS 2006»
15 years 5 months ago
A Redesigned Undergraduate Data Communication and Networking Course Incorporating Theory and Practice
Data Communication and Computer Networking is a traditional undergraduate CS course. Classic teaching focuses on communication protocol and algorithm analysis, plus socket programm...
Ziping Liu
NIPS
2004
15 years 5 months ago
Semi-Markov Conditional Random Fields for Information Extraction
We describe semi-Markov conditional random fields (semi-CRFs), a conditionally trained version of semi-Markov chains. Intuitively, a semiCRF on an input sequence x outputs a "...
Sunita Sarawagi, William W. Cohen
NIPS
2001
15 years 5 months ago
The Concave-Convex Procedure (CCCP)
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
Alan L. Yuille, Anand Rangarajan
IJCAI
2003
15 years 5 months ago
A Maximal Tractable Class of Soft Constraints
Many optimization problems can be expressed us­ ing some form of soft constraints, where different measures of desirability arc associated with differ­ ent combinations of domai...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...
WSC
2004
15 years 5 months ago
Approximate Time-Parallel Cache Simulation
In time-parallel simulation, the simulation time axis is decomposed into a number of slices which are assigned to parallel processes for concurrent simulation. Although a promisin...
Tobias Kiesling