Sciweavers

116 search results - page 3 / 24
» A New Intersection Model and Improved Algorithms for Toleran...
Sort
View
EACL
2009
ACL Anthology
13 years 3 months ago
Improving Grammaticality in Statistical Sentence Generation: Introducing a Dependency Spanning Tree Algorithm with an Argument S
like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, we model a global (sentence) level...
Stephen Wan, Mark Dras, Robert Dale, Cécile...
SMA
2009
ACM
134views Solid Modeling» more  SMA 2009»
13 years 11 months ago
Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
14 years 5 months ago
Fg-index: towards verification-free query processing on graph databases
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
James Cheng, Yiping Ke, Wilfred Ng, An Lu
IJWMC
2010
115views more  IJWMC 2010»
13 years 2 months ago
Small-world effects in wireless agent sensor networks
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
Kenneth A. Hawick, Heath A. James
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 5 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang