Sciweavers

11808 search results - page 2286 / 2362
» Isometries and Computability Structures
Sort
View
VL
2002
IEEE
165views Visual Languages» more  VL 2002»
14 years 3 months ago
Co-Ordination of Multiple External Representations during Java Program Debugging
Java program debugging was investigated in computer science students who used a software debugging environment (SDE) that provided concurrently displayed, adjacent, multiple and l...
Pablo Romero, Rudi Lutz, Richard Cox, Benedict du ...
SIGMOD
2010
ACM
207views Database» more  SIGMOD 2010»
14 years 3 months ago
Automatic contention detection and amelioration for data-intensive operations
To take full advantage of the parallelism offered by a multicore machine, one must write parallel code. Writing parallel code is difficult. Even when one writes correct code, the...
John Cieslewicz, Kenneth A. Ross, Kyoho Satsumi, Y...
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 3 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
14 years 3 months ago
Large graph processing in the cloud
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
Rishan Chen, Xuetian Weng, Bingsheng He, Mao Yang
ICALP
2010
Springer
14 years 2 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
« Prev « First page 2286 / 2362 Last » Next »