Sciweavers

5100 search results - page 552 / 1020
» The Linear Complexity of a Graph
Sort
View
AAAI
2008
15 years 9 months ago
Determining Possible and Necessary Winners under Common Voting Rules Given Partial Orders
Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alterna...
Lirong Xia, Vincent Conitzer
EUROGRAPHICS
2010
Eurographics
15 years 8 months ago
Fast and Efficient Skinning of Animated Meshes
Skinning is a simple yet popular deformation technique combining compact storage with efficient hardware accelerated rendering. While skinned meshes (such as virtual characters) a...
Ladislav Kavan, Peter-Pike Sloan, Carol O'Sullivan
MP
2008
117views more  MP 2008»
15 years 6 months ago
Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
Abstract. We study piecewise decomposition methods for mathematical programs with equilibrium constraints (MPECs) for which all constraint functions are linear. At each iteration o...
Giovanni Giallombardo, Daniel Ralph
DAM
1998
88views more  DAM 1998»
15 years 6 months ago
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
Stasys Jukna, Alexander A. Razborov
FM
2009
Springer
154views Formal Methods» more  FM 2009»
15 years 4 months ago
Specification and Verification of Web Applications in Rewriting Logic
Abstract. This paper presents a Rewriting Logic framework that formalizes the interactions between Web servers and Web browsers through icating protocol abstracting HTTP. The propo...
María Alpuente, Demis Ballis, Daniel Romero