Sciweavers

663 search results - page 65 / 133
» A Parallel Algorithm for Enumerating Combinations
Sort
View
ICDE
2005
IEEE
144views Database» more  ICDE 2005»
16 years 3 months ago
ViteX: A Streaming XPath Processing System
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
Yi Chen, Susan B. Davidson, Yifeng Zheng
ISPD
1999
ACM
85views Hardware» more  ISPD 1999»
15 years 6 months ago
Optimal partitioners and end-case placers for standard-cell layout
We study alternatives to FM-based partitioning in the context of end-case processing for top-down standard-cell placement. The primary motivation is that small partitioning instan...
Andrew E. Caldwell, Andrew B. Kahng, Igor L. Marko...
COMPSEC
2010
146views more  COMPSEC 2010»
15 years 2 months ago
An intruder model with message inspection for model checking security protocols
Model checking security protocols is based on an intruder model that represents the eavesdropping or interception of the exchanged messages, while at the same time performs attack...
Stylianos Basagiannis, Panagiotis Katsaros, Andrew...
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
15 years 8 months ago
Geometric Minimum Spanning Trees with GeoFilterKruskal
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
Samidh Chatterjee, Michael Connor, Piyush Kumar
COLT
2006
Springer
15 years 5 months ago
Online Multitask Learning
We study the problem of online learning of multiple tasks in parallel. On each online round, the algorithm receives an instance and makes a prediction for each one of the parallel ...
Ofer Dekel, Philip M. Long, Yoram Singer