Sciweavers

656 search results - page 122 / 132
» Minimal non-convex words
Sort
View
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
14 years 11 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
14 years 11 months ago
On-Line File Caching
Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of ...
Neal E. Young
ANLP
1994
108views more  ANLP 1994»
14 years 11 months ago
Does Baum-Welch Re-estimation Help Taggers?
In part of speech tagging by Hidden Markov Model, a statistical model is used to assign grammatical categories to words in a text. Early work in the field relied on a corpus which...
David Elworthy
WALCOM
2007
IEEE
151views Algorithms» more  WALCOM 2007»
14 years 10 months ago
Base Station Placement Problem on the Boundary of a Convex Region
Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. ...
BIS
2009
168views Business» more  BIS 2009»
14 years 10 months ago
Defining Adaptation Constraints for Business Process Variants
Abstract. In current dynamic business environment, it has been argued that certain characteristics of ad-hocism in business processes are desirable. Such business processes typical...
Ruopeng Lu, Shazia Wasim Sadiq, Guido Governatori,...