Sciweavers

876 search results - page 49 / 176
» New Results for the Martin Polynomial
Sort
View
ENGL
2008
101views more  ENGL 2008»
13 years 8 months ago
Identifying Perceptually Similar Languages Using Teager Energy Based Cepstrum
Language Identification (LID) refers to the task of identifying an unknown language from the test utterances. In this paper, a new method of feature extraction, viz., Teager Energy...
Hemant A. Patil, T. K. Basu
EOR
2002
105views more  EOR 2002»
13 years 8 months ago
Review of properties of different precedence graphs for scheduling problems
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
Jacek Blazewicz, Daniel Kobler
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 8 months ago
The Networked Common Goods Game
Abstract. We introduce a new class of games called the networked common goods game (NCGG), which generalizes the well-known common goods game [12]. We focus on a fairly general sub...
Jinsong Tan
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
14 years 18 days ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
Martin Hoefer, Alexander Souza
CP
2011
Springer
12 years 8 months ago
Hierarchically Nested Convex VCSP
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
Martin C. Cooper, Stanislav Zivny