Sciweavers

3038 search results - page 593 / 608
» High-Speed Function Approximation
Sort
View
EOR
2006
107views more  EOR 2006»
14 years 9 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
CC
2007
Springer
121views System Software» more  CC 2007»
14 years 9 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
CORR
2007
Springer
124views Education» more  CORR 2007»
14 years 9 months ago
An exploratory study of Google Scholar
Purpose – This paper2 discusses the new scientific search service Google Scholar (GS). This search engine, intended for searching exclusively scholarly documents, will be descri...
Philipp Mayr, Anne-Kathrin Walter
IVC
2006
187views more  IVC 2006»
14 years 9 months ago
Dynamics of facial expression extracted automatically from video
We present a systematic comparison of machine learning methods applied to the problem of fully automatic recognition of facial expressions, including AdaBoost, support vector mach...
Gwen Littlewort, Marian Stewart Bartlett, Ian R. F...
JMLR
2008
168views more  JMLR 2008»
14 years 9 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...