1511 search results - page 255 / 303 » Randomness, lowness and degrees |
112
click to vote
ICNP
1997
IEEE
15 years 6 months ago
1997
IEEE
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
113
click to vote
KDD
2010
ACM
15 years 3 months ago
2010
ACM
Linked or networked data are ubiquitous in many applications. Examples include web data or hypertext documents connected via hyperlinks, social networks or user profiles connected...
116
click to vote
NAACL
2003
15 years 3 months ago
2003
It is well known that frame independence assumption is a fundamental limitation of current HMM based speech recognition systems. By treating each speech frame independently, HMMs ...
131
click to vote
SDM
2003
SIAM
15 years 3 months ago
2003
SIAM
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
136
click to vote
ADHOC
2007
15 years 2 months ago
2007
Ensuring the consistency and the availability of replicated data in highly mobile ad hoc networks is a challenging task because of the lack of a backbone infrastructure. Previous ...