1081 search results - page 15 / 217 » Working with the LR Degrees |
142
click to vote
DIALM
2003
ACM
15 years 6 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
104
Voted
AAAI
2008
15 years 3 months ago
2008
Most standard learning algorithms, such as Logistic Regression (LR) and the Support Vector Machine (SVM), are designed to deal with i.i.d. (independent and identically distributed...
108
click to vote
LACL
2005
Springer
15 years 6 months ago
2005
Springer
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an associat...
116
Voted
TASLP
2008
15 years 18 days ago
2008
Abstract--In this paper, a new model-based algorithm for optimizing the MPEG-Advanced Audio Coder (AAC) in MS-stereo mode is presented. This algorithm is an extension to stereo sig...
100
click to vote
CORR
2006
Springer
15 years 22 days ago
2006
Springer
Abstract. It is widely believed that the Internet's AS-graph degree distribution obeys a power-law form. However, it was recently argued that since Internet data is collected ...