Sciweavers

1615 search results - page 323 / 323
» What's new
Sort
View
ICSE
2012
IEEE-ACM
11 years 7 months ago
Characterizing logging practices in open-source software
—Software logging is a conventional programming practice. While its efficacy is often important for users and developers to understand what have happened in the production run, ...
Ding Yuan, Soyeon Park, Yuanyuan Zhou
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 5 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
13 years 10 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
JCSS
2008
120views more  JCSS 2008»
13 years 4 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
CORIA
2011
12 years 8 months ago
Mining the Web for lists of Named Entities
Named entities play an important role in Information Extraction. They represent unitary namable information within text. In this work, we focus on groups of named entities of the s...
Arlind Kopliku, Mohand Boughanem, Karen Pinel-Sauv...