Sciweavers

3413 search results - page 442 / 683
» New Support Vector Algorithms
Sort
View
FOCS
2009
IEEE
15 years 10 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
ASIAN
2006
Springer
98views Algorithms» more  ASIAN 2006»
15 years 7 months ago
Information Hiding in the Join Calculus
Abstract. We aim to provide information hiding support in concurrent object-oriented programming languages. We study the issue both at the object level and class level, in the cont...
Qin Ma 0002, Luc Maranget
119
Voted
STTT
2008
90views more  STTT 2008»
15 years 3 months ago
A uniform framework for weighted decision diagrams and its implementation
1 This papers introduces a generic framework for OBDD variants with weighted edges. It covers many boolean and multi-valued OBDD-variants that have been studied in the literature a...
Jörn Ossowski, Christel Baier
INFOCOM
2000
IEEE
15 years 8 months ago
Fast and Scalable Priority Queue Architecture for High-Speed Network Switches
-In this paper, we present a fast and scalable pipelined priority queue architecture for use in high-performance switches with support for fine-grained quality of service (QoS) gu...
Ranjita Bhagwan, Bill Lin
POPL
2003
ACM
16 years 4 months ago
Bitwidth aware global register allocation
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
Sriraman Tallam, Rajiv Gupta