Sciweavers

925 search results - page 114 / 185
» A Solution to the Extended GCD Problem
Sort
View
DATESO
2007
107views Database» more  DATESO 2007»
13 years 10 months ago
Updating Typed XML Documents Using a Functional Data Model
We address a problem of updating XML documents having their XML schema described by a Document Type Definition (DTD) without breaking their validity. We present a way how to expre...
Pavel Loupal
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
14 years 4 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid
CMA
2010
134views more  CMA 2010»
13 years 6 months ago
Particle tracking for fractional diffusion with two time scales
Abstract. Previous work [51] showed how to solve time-fractional diffusion equations by particle tracking. This paper extends the method to the case where the order of the fraction...
Mark M. Meerschaert, Yong Zhang, Boris Baeumer
INFOCOM
2009
IEEE
14 years 3 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
WADS
2009
Springer
232views Algorithms» more  WADS 2009»
14 years 3 months ago
On Making Directed Graphs Transitive
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
Mathias Weller, Christian Komusiewicz, Rolf Nieder...